A constructive characterization of the split closure of a mixed integer linear program
نویسنده
چکیده
Two independent proofs of the polyhedrality of the split closure of Mixed Integer Linear Program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.
منابع مشابه
Characterization of the split closure via geometric lifting
We analyze split cuts from the perspective of cut generating functions via geometric lifting. We show that α-cuts, a natural higher-dimensional generalization of the k-cuts of Cornuéjols et al., gives all the split cuts for the mixed-integer corner relaxation. As an immediate consequence we obtain that the k-cuts are equivalent to split cuts for the 1-row mixed-integer relaxation. Further, we s...
متن کاملCutting planes from extended LP formulations
Given a mixed-integer set defined by linear inequalities and integrality requirements on some of the variables, we consider extended formulations of its continuous (LP) relaxation and study the effect of adding cutting planes in the extended space. In terms of optimization, extended LP formulations do not lead to better bounds as their projection onto the original space is precisely the origina...
متن کاملOptimizing over the split closure
The polyhedron defined by all the split cuts obtainable directly (i.e. without iterated cut generation) from the LP-relaxation P of a mixed integer program (MIP) is termed the (elementary, or rank 1) split closure of P . This paper deals with the problem of optimizing over the split closure. This is accomplished by repeatedly solving the following separation problem: given a fractional point, s...
متن کاملApproximating the Split Closure
The split closure has been proved in practice to be a very tight approximation of the integer hull formulation of a generic mixed-integer linear program. However, exact separation procedures for optimizing over the split closure have unacceptable computing times in practice, hence many different heuristic strategies have been proposed in the last years. In this paper we present a new overall fr...
متن کاملMIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007